Performance optimization over positive l∞ cones

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Performance optimization over positive l∞ cones

In this paper, we first consider the case where the input to a system is restricted to be in the positive cone of l∞, denoted by l+ ∞ , and seek to characterize the system’s induced norm from l+ ∞ to l∞. We obtain an exact characterization of this norm which is particularly easy to calculate in the case of LTI systems. Furthermore, we consider the model matching problem to show that time-varyin...

متن کامل

Exact duality for optimization over symmetric cones

We present a strong duality theory for optimization problems over symmetric cones without assuming any constraint qualification. We show important complexity implications of the result to semidefinite and second order conic optimization. The result is an application of Borwein and Wolkowicz’s facial reduction procedure to express the minimal cone. We use Pataki’s simplified analysis and provide...

متن کامل

Optimization over Positive Polynomial Matrices

Positive polynomial matrices play a fundamental role in systems and control theory. We give here a simplified proof of the fact that the convex set of positive polynomial matrices can be parameterized using block Hankel and block Toeplitz matrices. We also show how to derive efficient computational algorithms for optimization problems over positive pseudo polynomial matrices over the real line,...

متن کامل

T-algebras and linear optimization over symmetric cones

Euclidean Jordan-algebra is a commonly used tool in designing interiorpoint algorithms for symmetric cone programs. T -algebra, on the other hand, has rarely been used in symmetric cone programming. In this paper, we use both algebraic characterizations of symmetric cones to extend the target-following framework of linear programming to symmetric cone programming. Within this framework, we desi...

متن کامل

Second-order optimality and duality in vector optimization over cones

In this paper, we introduce the notion of a second-order coneconvex function involving second-order directional derivative. Also, second-order cone-pseudoconvex, second-order cone-quasiconvex and other related functions are defined. Second-order optimality and Mond-Weir type duality results are derived for a vector optimization problem over cones using the introduced classes of functions.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Automatica

سال: 2017

ISSN: 0005-1098

DOI: 10.1016/j.automatica.2017.02.038